Coverage Optimization with a Dynamic Network of Drone Relays

Dynamic Base Station Energy Saving with Relays

The network design problem with relays

The network design problem with relays (NDPR) is defined on an undirected graph G = (V,E,K), where V = {1, . . . ,n} is a vertex set, E = {(i, j) : i, j 2 V, i < j} is an edge set. The set K = {(o(k),d(k))} is a set of communication pairs (or commodities): o(k) 2 V and d(k) 2 V denote the origin and the destination of the kth commodity, respectively. With each edge (i, j) are associated a cost ...

Network Optimization with Concave Costs

In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.

Network Optimization with Concave Costs

In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.

Optimization Approaches for the Traveling Salesman Problem with Drone

The fast and cost-efficient home delivery of goods ordered online is logistically challenging. Many companies are looking for new ways to cross the last-mile to their customers. One technology-enabled opportunity that recently has received much attention is the use of a drone to support deliveries. An innovative last-mile delivery concept in which a truck collaborates with a drone to make deliv...